Generating 5-regular planar graphs
نویسندگان
چکیده
For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each Pk. ∗Research partially supported by NSF grants DMS-0556091 and ITR-0326387. †Research partially supported by Board of Regents grant LEQSF(2004-07)-RD-A-22.
منابع مشابه
Generating all 3-connected 4-regular planar graphs from the octahedron graph
We prove that all 3-connected 4-regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all connected 4-regular planar graphs from the
متن کاملEnumeration of labeled 4-regular planar graphs
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic ...
متن کاملGenerating Large Random Knot Diagrams
In this paper, we study the problem of generating large random knot diagrams, namely 4-regular planar graphs that are regular projections of prime knots or links. We propose two methods and explore various questions that arise along the way.
متن کاملRecursive Generation of 5-Regular Planar Graphs
We describe for the first time how the 5-regular simple planar graphs can all be obtained from a simple family of starting graphs by repeatedly applying a few expansion operations. The proof uses an innovative amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic 5-regular planar graphs ...
متن کاملRecursive generation of simple planar 5-regular graphs and pentangulations
We describe how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 61 شماره
صفحات -
تاریخ انتشار 2009